Experiments with resolution-based theorem-proving algorithms
نویسندگان
چکیده
منابع مشابه
Resolution-Based Theorem Proving for Manyvalued Logics
A general approach to automated theorem proving for all rst-order nite-valued logics that can be deened truth-functionally is described. The suggested proof procedure proceeds in two, largely independent, steps. First, logic-speciic translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic. The worst-case complexity of the translation rules is analysed ...
متن کاملResolution-Based Theorem Proving for SHn-Logics
In this paper we illustrate by means of an example, namely SHn-logics, a method for translation to clause form and automated theorem proving for first-order many-valued logics based on distributive lattices with operators.
متن کاملResolution Theorem Proving
Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson in the early 1960's to accelerate rst order inference Robinson, 1965]. A complete inference procedure had been done by Martin Davis and Hillary Putnam a few years prior to Robinson's work Davis and Putnam, 1960]. Unfortunately, it was a ground procedure and suuered f...
متن کاملNon-Resolution Theorem Proving
This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution. These include: knowledge bases, natural deduction, reduction, (rewrite rules), typing, procedures, advice, controlled forward chaining, algebraic simplification, built-in associativity and commutativity, models, analogy, and man-machine systems. Exampl...
متن کاملBreeding Theorem Proving Heuristics with Genetic Algorithms
First-order theorem provers have to search for proofs in an infinite space of possible derivations. Proof search heuristics play a vital role for the practical performance of these systems. In the current generation of saturation-based theorem provers like SPASS, E, Vampire or Prover 9, one of the most important decisions is the selection of the next clause to process with the given clause algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1982
ISSN: 0898-1221
DOI: 10.1016/0898-1221(82)90053-0